Hyperplane cuts of an n-cube
نویسندگان
چکیده
منابع مشابه
Partial hyperplane activation for generalized intersection cuts
The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investigate this computationally unexplored paradigm and observe that a key hyperplane activation procedure embedded in it is not computationally viable. To overcome this issue, we develop a novel replacement to this procedur...
متن کاملClustering with Normalized Cuts is Clustering with a Hyperplane
We present a set of clustering algorithms that identify cluster boundaries by searching for a hyperplanar gap in unlabeled data sets. It turns out that the Normalized Cuts algorithm of Shi and Malik [1], originally presented as a graph-theoretic algorithm, can be interpreted as such an algorithm. Viewing Normalized Cuts under this light reveals that it pays more attention to points away from th...
متن کاملAutomorphisms of the Cube n
Consider a hypergraph H n where the vertices are points of the d-dimensional combinatorial cube n and the edges are all sets of n points such that they are in one line. We study the structure of the group of automorphisms of H n, i.e., permutations of points of n d preserving the edges. In this paper we provide a complete characterization. Moreover, we consider the Colored Cube Isomorphism prob...
متن کاملAn axiomatization of the median procedure on the n-cube
Abstract The general problem in location theory deals with functions that find sites on a graph (discrete case) or network (continuous case) in such a way as to minimize some cost (or maximize some benefit) to a given set of clients represented by vertices on the graph or points on the network. The axiomatic approach seeks to uniquely distinguish, by using a list of intuitively pleasing axioms,...
متن کاملSkeletons of Some Relatives of the N-cube Skeletons of Some Relatives of the N-cube
We study the skeleton of several polytopes related to the n-cube, the halved n-cube, and the folded n-cube. In particular, the Gale polytope of the n-cube, its dual and the duals of the halved n-cube and the complete bipartite sub-graphs polytope.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1971
ISSN: 0012-365X
DOI: 10.1016/0012-365x(71)90025-2